Modular Constructions for Combinatorial Geometries
نویسنده
چکیده
R. Stanley, in an investigation of modular flats in geometries (Algebra Universalis 1-2 (1971), 214—217), proved that the characteristic polynomial xW of a modular flat x divides the characteristic polynomial x(G) of a geometry G. In this paper we identify the quotient: THEOREM. // x is a modular flat of G, x(G)/x(x) = X(7^(G))/(\ 1), where TX{G) is the complete Brown truncation of G by x. (The lattice of TX(G) consists of all flats containing x and all flats disjoint from x, with the induced order from G.) We give many characterizations of modular flats in terms of their lattice properties as well as by means of a short-circuit axiom and a modular version of the MacLane-Steinitz exchange axiom. Modular flats are shown to have many of the useful properties of points and distributive flats (separators) in addition to being much more prevalent. The theorem relating the chromatic polynomials of two graphs and the polynomial of their vertex join across a common clique generalizes to geometries: THEOREM. Given geometries G and H, if x is a modular flat of G as well as a subgeometry of H, then there exists a geometry P = PX(G, H) which is a pushout in the category of injective strong maps and such that x(P) = X(G)x(H)lx(x)The closed set structure, rank function, independent sets, and lattice properties of P are characterized. After proving a modular extension theorem we give applications of our results to Crapo's single element extension theorem, Crapo's join operation, chain groups, unimodular geometries, transversal geometries, and graphs.
منابع مشابه
Functions of the category of combinatorial geometries and strong maps
As in the case with most mathematical structures, an important question in the theory of combinatorial geometries is to develop constructions for obtaining new geometries from old ones. Several geometric constructions are well-known, e.g. deletion, contraction, truncation, direct sums, etc. . . . and are generally extensions to combinatorial geometries of existing operations on projective geome...
متن کاملApplications of finite geometries to information security
Many problems in information security can be resolved using combinatorial structures, primarily geometries. In fact, often the most efficient solutions kn'awn are provided by schemes based on geometries. In this expository article we look at two problems in information security and discuss proposed geometrical solutions. In addition, we generalise two known constructions for Key Distribution Pa...
متن کاملThe geometry of Hrushovski constructions, II. The strongly minimal case
We investigate the isomorphism types of combinatorial geometries arising from Hrushovski’s flat strongly minimal structures and answer some questions from Hrushovski’s original paper.
متن کاملPreliminaries for Squashed Geometries and Diagrams A) Preliminaries for Squashed Geometries. Definition 1.1. Let X Be a Finite Set, F Be a Clutter of Subsets of X And
F-squashed geometries, one of the many recent generalizations of matroids, include a wide range of combinatorial structures but still admit a direct extension of many matroidal axiomatizations and also provide a good framework for studying the performance of the greedy algorithm in any independence system. Here, after giving all necessary preliminaries in section ], we consider in section 2 F-s...
متن کاملCoding Theory and Algebraic Combinatorics
This chapter introduces and elaborates on the fruitful interplay of coding theory and algebraic combinatorics, with most of the focus on the interaction of codes with combinatorial designs, finite geometries, simple groups, sphere packings, kissing numbers, lattices, and association schemes. In particular, special interest is devoted to the relationship between codes and combinatorial designs. ...
متن کامل